package leetcode.leetcode_1317;

class Solution {
    public int[] getNoZeroIntegers(int n) {
        for (int i=1;i<n;i++){
            if (check(n-i)&&check(i)){
                return new int[]{i,n-i};
            }
        }
        return new int[]{};
    }
    public boolean check(int n ){
        while(n>0){
            int x = n%10;
            if (x==0) return false;
            n = n/10;
        }
        return true;
    }
}